Valuations on modular lattices

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Complete Valuations on Finite Distributive Lattices

We characterize the finite distributive lattices which admit a complete valuation, that is bijective over a set of consecutive natural numbers, with the additional conditions of completeness (Definition 2.3). We prove that such lattices are downset lattices of finite posets of dimension at most two, and determine a realizer through a recursive relation between weights on the poset associated to...

متن کامل

Valuations on Lattices: Fuzzification and its Implications

The notion of ordering is perhaps one of the most fundamental of abstract concepts. The zeta function is used to algebraically describe the ordering of elements in a lattice. An appropriate generalization of the zeta function generalizes the notion of inclusion to degrees of inclusion. However, the lattice structure imposes strong constraints on the values that these degrees can take. Here we r...

متن کامل

Lattices of Paths: Representation Theory and Valuations

We study some distributive lattices arising in the combinatorics of lattice paths. In particular, for the Dyck, Motzkin and Schröder lattices we describe the spectrum and we determine explicitly the Euler characteristic in terms of natural parameters of lattice paths. AMS Classification: Primary: 06D05; Secondary: 06A07.

متن کامل

On Complete Congruence Lattices of Complete Modular Lattices

The lattice of all complete congruence relations of a complete lattice is itself a complete lattice. In 1988, the second author announced the converse: every complete lattice L can be represented as the lattice of complete congruence relations of some complete lattice K. In this paper we improve this result by showing that K can be chosen to be a complete modular lattice. Internat. J. Algebra C...

متن کامل

Public-Key Cryptography Based on Modular Lattices

We present an approach to generalization of practical Identity-Based Encryption scheme of [BF01]. In particular we show how the protocol could be used on finite modular lattices and as a special case on vector spaces over finite field. The original proof of security for this protocol does not hold in this general algebraic structure, thus this is still a work in progress.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematica Bohemica

سال: 1991

ISSN: 0862-7959,2464-7136

DOI: 10.21136/mb.1991.126021